Parametrizing an Integer Linear Program by an Integer
نویسندگان
چکیده
منابع مشابه
An integer linear programming approach for bilinear integer programming
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.
متن کاملColored Nonograms: An Integer Linear Programming Approach
In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black and white nonograms only, thus providing a universal solution for solving nonograms using ILP. Additionally we apply a known algorithm to find all solutions to a puzzle. This algorithm uses a binary cut to exclude already known ...
متن کاملAn evolutionary solver for linear integer programming
In this paper we introduce an evolutionary algorithm for the solution of linear integer programs. The strategy is based on the separation of the variables into the integer subset and the continuous subset; the integer variables are fixed by the evolutionary system, and the continuous ones are determined in function of them, by a linear program solver. We report results obtained for some standar...
متن کاملMultiplication by an Integer Constant
We present and compare various algorithms, including a new one, allowing to perform multiplications by integer constants using elementary operations. Such algorithms are useful, as they occur in several problems, such as the Toom-Cook-like algorithms to multiply large multiple-precision integers, the approximate computation of consecutive values of a polynomial, and the generation of integer mu...
متن کاملInteger convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1102458